On the behavior of Dempster’s rule of combination
نویسندگان
چکیده
In this paper we present simple examples showing the insensitivity of Dempster’s rule of combination proposed in Dempster-Shafer Theory (DST) of evidence with respect to the level of conflict between two sources of evidences. Aside famous Zadeh’s example on the validity of Dempster’s rule of combination, it is shown that for an infinite number of cases Dempster’s rule does not respond adequately to combine sources of evidence even when the level of conflict between sources is low. For a comparison purpose, we present the solution obtained by the more efficient PCR5 fusion rule proposed originally in Dezert-Smarandache Theory (DSmT) framework.
منابع مشابه
Geometry of Dempster’s Rule
In this paper we analyze the nature of Shafer’s belief functions as geometric entities. We focus on the geometric behavior of Dempster’s rule of combination in the context of the belief space, i.e. the set of all the admissible belief functions defined over a given finite domain. After showing how convex closure and orthogonal sum commute in the belief space and introducing the concept of condi...
متن کاملDempster's Rule as Seen by Little Colored Balls
Dempster’s rule is traditionally interpreted as an operator for fusing belief functions. While there are different types of belief fusion, there has been considerable confusion regarding the exact type of operation that Dempster’s rule performs. Many alternative operators for belief fusion have been proposed, where some are based on the same fundamental principle as Dempster’s rule, and others ...
متن کاملA GENERALIZATION OF THE CLASSIC COMBINATION RULES TO DSm HYPER-POWER SETS
Dempster’s rule, Yager’s rule and Dubois-Prade’s rule for belief functions combination are generalized to be applicable to hyper-power sets according to the DSm theory. A comparison of the rules with DSm rule of combination is presented.
متن کاملAn Improved Dempster-Shafer Algorithm Using a Partial Conflict Measurement
Multiple evidences based decision making is an important functionality for computers and robots. To combine multiple evidences, mathematical theory of evidence has been developed, and it involves the most vital part called Dempster’s rule of combination. The rule is used for combining multiple evidences. However, the combined result gives a counterintuitive conclusion when highly conflicting ev...
متن کاملGENERALIZATION OF THE CLASSIC COMBINATION RULES TO DSm HYPER-POWER SETS
In this article, the author generalizes Dempster’s rule, Yager’s rule, and Dubois-Prade’s rule for belief functions combination in order to be applicable to hyper-power sets according to the Dezert-Smarandache (DSm) Theory. A comparison of the rules with the DSm rule of combination is further presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011